Automated fingerprint recognition using structural matching
نویسندگان
چکیده
-Automated fingerprint recognition has received considerable attention over the past decade . Progress has been made on models of the structure of fingerprints, techniques for the acquisition of prints, and the development of commercial automated fingerprint recognition systems . Despite these advances, there remain considerable opportunities for improvement. The speed of retrieval, and the ability to recognize partial or distorted prints are prominent among those areas that require improvement . This study will describe a structural model of fingerprints, based on local structural relations among features, and an associated automated recognition system which addresses the limitations of existing fingerprint models . Fingerprint recognition Image processing Feature extraction Structural matching Partitioning Identification
منابع مشابه
SIFT-Based Low-Quality Fingerprint LSH Retrieval and Recognition Method
Most of the existing fingerprint retrieval systems are based on the overall characteristics and detailed features of fingerprints, and their performance is poor in the cases of low-quality fingerprint images, such as incomplete fingerprint images. In order to improve the recognition speed, accuracy, and robustness of automated fingerprint recognition systems based on large-scale fingerprint dat...
متن کاملAutomatic Fingerprint Recognition Using Minutiae Matching Technique for the Large Fingerprint Database
Extracting minutiae from fingerprint images is one of the most important steps in automatic fingerprint identification system. Because minutiae matching are certainly the most well-known and widely used method for fingerprint matching, minutiae are local discontinuities in the fingerprint pattern. In this paper a fingerprint matching algorithm is proposed using some specific feature of the minu...
متن کاملFingerprint identification using graph matching
Abstract--A new algorithm for automated fingerprint encoding and matching is presented. The algorithm is intended to be insensitive to imperfections introduced during fingerprint registration, such as noise. distortion and displacement. A fingerprint is represented in the form of a graph whose nodes correspond to ridges in the print. Edges of the graph connect nodes that represent neighboring o...
متن کاملEfficient Fingerprint Recognition Through Improvement of Feature Level Clustering, Indexing and Matching Using Discrete Cosine Transform
Fingerprint recognition refers to the automated method of verifying a match between two human fingerprints. Fingerprints are one of many forms of biometrics used to identify an individual and verify the identity. Because of their uniqueness and consistency over time, fingerprints have been used for over a century, more recently becoming automated biometric due to advancement in computing capabi...
متن کاملFingerprint Recognition Using Level 3 Feature Extraction Method and Matching Using Sift Algorith
to design fingerprint Level 3 feature extraction method and match using SIFT algorithm. Firstly fingerprint of good quality are acquired by using optical scanner. Image normalization is done using Gaussian blurring and sliding window contrast adjustment. Pores are extracted and estimated. Using these estimated pores, matching is done from template database to stored database using SIFT algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 23 شماره
صفحات -
تاریخ انتشار 1990